A New Space-Time Code Based on Permutation Matrices
نویسندگان
چکیده
A full diversity block space-time code over two transmit antennas and two symbol periods is introduced. The proposed method results in substantial performance improvement over the widely used scheme of Alamouti [1] and at the same time allows for a simple maximum likelihood decoding algorithm.
منابع مشابه
The remoteness of the permutation code of the group $U_{6n}$
Recently, a new parameter of a code, referred to as the remoteness, has been introduced.This parameter can be viewed as a dual to the covering radius. It is exactly determined for the cyclic and dihedral groups. In this paper, we consider the group $U_{6n}$ as a subgroup of $S_{2n+3}$ and obtain its remoteness. We show that the remoteness of the permutation code $U_{6n}$ is $2n+2$. Moreover, ...
متن کاملCryptanalysis of Two McEliece Cryptosystems Based on Quasi-Cyclic Codes
We cryptanalyse here two variants of the McEliece cryptosystem based on quasi-cyclic codes. Both aim at reducing the key size by restricting the public and secret generator matrices to be in quasi-cyclic form. The first variant considers subcodes of a primitive BCH code. The aforementioned constraint on the public and secret keys implies to choose very structured permutations. We prove that thi...
متن کاملBer Enhancement of Mimo-cdma Based on Space-time Block Codes
Now a days, the demand for wireless communication systems with high data rates and high capacity has dramatically increased. CDMA (Code Division Multiple access) plays an important role in modern wireless communication systems. MIMO refers to links with multiple antennas at the transmitter and receiver side. CDMA with MIMO is a very promising technique beyond 3G and 4G wireless communications. ...
متن کاملSpace Time Codes from Permutation Codes
A new class of space time codes with high performance is presented. The code design utilizes tailor-made permutation codes, which are known to have large minimal distances as spherical codes. A geometric connection between spherical and space time codes has been used to translate them into the final space time codes. Simulations demonstrate that the performance increases with the block lengths,...
متن کاملApproach to the construction of regular low-density parity-check codes from group permutation matrices
In this study, a new method for constructing low-density parity-check (LDPC) codes is presented. This construction is based on permutation matrices which come from a finite abstract group and hence the codes constructed in this manner are called group permutation low-density parity-check (GP-LDPC) codes. A necessary and sufficient condition under which a GP-LDPC code has a cycle, is given and s...
متن کامل